On Voltage Graphs and Cages

نویسنده

  • Geoffrey Exoo
چکیده

Using voltage graphs, we construct the the smallest known trivalent graph of girth 16. The graph has 960 vertices and is a lift of the Petersen graph. By way of preparation, other lifts of the Petersen graph are discussed. AMS Subject Classifications: 05C25, 05C35

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voltage Graphs, Group Presentations and Cages

We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations. AMS Subject Classifications: 05C25, 05C35

متن کامل

On Some Properties of Cages

A (k; g)-cage is a graph with the minimum order among all k-regular graphs with girth g. As a special family of graphs, (k; g)-cages have a number of interesting properties. In this paper, we investigate various properties of cages, e.g., connectivity, the density of shortest cycles, bricks and braces.

متن کامل

Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages

Let q be a prime power and g ∈ {6, 8, 12}. In this paper we obtain (q, g)-graphs on 2qg/2−3(q2 − 1) vertices for g = 6, 8, 12 as subgraphs of known (q + 1, g)-cages. We also obtain (q − r, 6)-graphs on 2(q2 − rq − 1) vertices, and (q − r, 8)-graphs on 2(q3−rq2−q+r) vertices where r is a positive integer such that q ≥ r+3. Furthermore, we find (q − 1, 12)-graphs of order 2q2(q3 − q2 − q + 1). So...

متن کامل

Biregular Cages of Girth Five

Let 2 6 r < m and g be positive integers. An ({r,m}; g)–graph (or biregular graph) is a graph with degree set {r,m} and girth g, and an ({r,m}; g)–cage (or biregular cage) is an ({r,m}; g)–graph of minimum order n({r,m}; g). If m = r+1, an ({r,m}; g)–cage is said to be a semiregular cage. In this paper we generalize the reduction and graph amalgam operations from [M. Abreu, G. Araujo–Pardo, C. ...

متن کامل

Small Regular Graphs of Girth 7

In this paper, we construct new infinite families of regular graphs of girth 7 of smallest order known so far. Our constructions are based on combinatorial and geometric properties of (q + 1, 8)-cages, for q a prime power. We remove vertices from such cages and add matchings among the vertices of minimum degree to achieve regularity in the new graphs. We obtain (q + 1)-regular graphs of girth 7...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003